Checking Secrecy by Means of Partial Order Reduction
نویسندگان
چکیده
We propose a partial order reduction for model checking security protocols for the secrecy property. Based on this reduction we develop an automatic tool that can check security protocols for secrecy, given a finite execution scenario. We compare this tool to several other tools.
منابع مشابه
Partial Order Reduction for Security Protocols
Security protocols are concurrent processes that communicate using cryptography with the aim of achieving various security properties. Recent work on their formal verification has brought procedures and tools for deciding trace equivalence properties (e.g., anonymity, unlinkability, vote secrecy) for a bounded number of sessions. However, these procedures are based on a naive symbolic explorati...
متن کاملWhy Confluence is More Powerful than Ample Sets in Probabilistic and Non-Probabilistic Branching Time
Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This presentation provides an extensive comparison between these two methods, answering the long-standing question of how they relate. We show that, while both preserve branching time properties, confluence reduction...
متن کاملConfluence versus Ample Sets in Probabilistic Branching Time
To improve the efficiency of model checking in general, and probabilistic model checking in particular, several reduction techniques have been introduced. Two of these, confluence reduction and partial-order reduction by means of ample sets, are based on similar principles, and both preserve branching-time properties for probabilistic models. Confluence reduction has been introduced for probabi...
متن کاملCombining Partial
Partial order based reduction techniques to reduce time and memory in model-checking procedures are becoming quite popular. Partial order reduction techniques exploit the independence of actions. Symmetry based reduction techniques exploit the inherent structure of the system to reduce the state space explored during model checking. We provide an abstract framework for combining partial-order a...
متن کاملOn Partial-Order Reduction and Trail Improvement in Directed Model Checking
In this paper we address the problem of reconciling trail improvement, partial order reduction and directed explicit state model checking. While directed model checking addresses the problem of finding optimally short counterexamples, trail improvement seeks to find shorter trails to some given error state. Both directed model checking and trail improvement employ heuristic, guided search techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004